Improved Behaviour of Tries by Adaptive Branching
نویسندگان
چکیده
We introduce and analyze a method to reduce the search cost in tries. Traditional trie structures use branching factors at the nodes that are either xed or a function of the number of elements. Instead, we let the distribution of the elements guide the choice of branching factors. This is accomplished in a strikingly simple way: in a binary trie, the i highest complete levels are replaced by a single node of degree 2 i ; the compression is repeated in the sub-tries. This structure, the level-compressed trie, inherits the good properties of binary tries with respect to neighbour and range searches, while the external path length is signiicantly decreased. It also has the advantage of being easy to implement. Our analysis shows that the expected depth of a stored element is (log n) for uniformly distributed data.
منابع مشابه
Analysis of a Class of Tries with Adaptive Multi-digit Branching
We study a class of adaptive multi-digit tries, in which the numbers of digits rn processed by nodes with n incoming strings are such that, in memoryless model (with n →∞): rn → log n η (pr.) where η is an algorithm-specific constant. Examples of known data structures from this class include LC-tries (Andersson and Nilsson, 1993), ”relaxed” LC-tries (Nilsson and Tikkanen, 1998), tries with loga...
متن کاملOn Time-Space Efficiency of Digital Trees with Adaptive Multi-Digit Branching∗
We consider a class of digital trees (tries) with adaptive selection of degrees of their nodes. This class includes LC-tries of Andersson and Nilsson (1993) which recursively replace all complete subtrees in the original tries with larger (multi-digit) nodes, as well as dynamic tries of Nilsson and Tikkanen (1998) which recursively replace all subtrees of bounded sparseness (a ratio of the numb...
متن کاملThe Paradox of Intervening in Complex Adaptive Systems; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”
This commentary addresses two points raised by Kitson and colleagues’ article. First, increasing interest in applying the Complexity Theory lens in healthcare needs further systematic work to create some commonality between concepts used. Second, our need to adopt a better understanding of how these systems organise so we can change the systems overall behaviour, creates a paradox. We seek to m...
متن کاملTowards Modelling Adaptive Attacker's Behaviour
We describe our model for the behaviour of an attacker. In the model, the attacker has uncertain knowledge about a computer system. Moreover, the attacker tries different attack paths if initially selected ones cannot be completed. The model allows finer-grain analysis of the security of computer systems. The model is based on Markov Decision Processes theory for predicting possible attacker’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 46 شماره
صفحات -
تاریخ انتشار 1993